Efficient joint source-channel decoding of multi-state Markov sequences

نویسندگان

  • H. Kim
  • D. S. Har
  • Zhi-Hong Mao
  • Mingui Sun
  • Heung-No Lee
چکیده

In this study, joint source–channel decoding for non-binary source samples is conducted. The non-binary source samples can be modelled as the output of a multi-state Markov chain (MC). As the source samples are directly transmitted after channel coding without source compression, the transmitted signals can be highly correlated. At the receiver, the multistate MC module can be designed to exploit the statistical correlation of source samples to improve the error correcting performance. However, as the number of states is increased, the multi-state MC module requires high computational complexity. To alleviate this problem, a simplified MC module is proposed. In the simplified MC module, the multi-state MC is replaced with multiple number of two-state MCs each of which exploits bit-level correlation of samples. Simulation results demonstrate that the simplified MC module can lead to competitive reduction in the required signal-to-noise ratio in comparison with the multi-state MC module with reduced computational complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Zero-Delay Joint Source-Channel Coding

We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...

متن کامل

Joint source-channel turbo decoding of VLC-coded Markov sources

We analyse the dependencies between the variables involved in the source and channel coding chain. This chain is composed of 1/ a Markov source of symbols, followed by 2/ a variable length source coder, and 3/ a channel coder. The output process is analysed in the framework of Bayesian networks, which provide both an intuitive representation of the structure of dependencies, and a way of derivi...

متن کامل

Joint Source-Channel Decoding of Variable-Length Codes with Soft Information: A Survey

Multimedia transmission over time-varying wireless channels presents a number of challenges beyond existing capabilities conceived so far for third-generation networks. Efficient quality-of-service (QoS) provisioning for multimedia on these channels may in particular require a loosening and a rethinking of the layer separation principle. In that context, joint source-channel decoding (JSCD) str...

متن کامل

Comparison of receiver training methods in joint iterative channel estimation and decoding in flat fading channels

Ab\r/no-In this paper we compare two different methods for receiver training in flat fading channels. The first method is the traditional way in which periodic training sequences are sent to the receiver (explicit training). In the second method, recently proposed, the information source emits bits with unequal probabilities of being ‘0’ and ‘1’. This method is called implicit training, since t...

متن کامل

Soft-decoding Based Vector Quantization For Hidden-Markov Channels

Recently, channel optimized vector quantization (COVQ) has received considerable attention as an approach to joint source-channel coding. In this paper we study COVQ for hidden Markov channels, with applications in wireless communication over fading channels. In contrast to previous work, we consider optimal VQ decoding for finitestate channels when the channel state is not explicitly observed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IET Communications

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2012